The Pure Logic of Ground
نویسنده
چکیده
I lay down a system of structural rules for various notions of ground and establish soundness and completeness. Ground is the relation of one truth holding in virtue of others. This relation is like that of consequence in that a necessary connection must hold between the relata if the relation is to obtain but it differs from consequence in so far as it required that there should also be an explanatory connection between the relata. The grounds must account for what is grounded. Thus even though P is a consequence of P & P, P & P is not a ground for P, since it does not account for the truth of P. It is the aim of this paper to develop a semantics and proof theory for the pure logic of ground. The pure logic of ground stands to ground as Gentzen’s structural rules stand to consequence. One prescinds from the internal structure of the propositions under consideration and simply asks what follows from what in virtue of the formal features of the underlying relation. Thus the claim that ground is transitive, that if P is a ground for Q and Q a ground for R then P should be a ground for R, is plausibly regarded as part of the pure logic of ground; but the claim that P is a ground for P & P will be part of the applied as opposed to the pure logic of ground, since it turns on the logical properties of &. The question of the logic of ground has been considered by a number of other authors (even if not exactly under this head) and so it may be helpful to bring out some of the more distinctive aspects of my own approach.1 I have, in the first place, attempted to be rigorous and systematic in the development of the logic. Rather than simply laying down various principles that I regard as true, I have specified various formal systems of which these principles are a part. These systems, in familiar fashion, thereby become the object of metalogical study; they can be assessed for consistency, assigned a semantics, compared for proof-theoretic strength, etc. There are two other, more particular, aspects of my approach. The first lies in its conceptual basis. Most other philosophers have worked almost exclusively with a concept of strict ground, under which a truth is not capable (or, at least, not normally capable) of being a ground for itself.2 But I believe that there is also an important concept of weak ground, under which a truth will automatically be a ground for itself. Very roughly, we may say that strict grounds must move us down in the explanatory order while weak grounds must not move us up. Thus P can weakly ground P, but P & P cannot weakly ground P given that P strictly grounds P & P. Received: September 22, 2009. 1 The authors include Audi (2011), Batchelor (2010), Correia (2005, 2011), Rosen (2010), Schnieder (2006, 2011), Fine (2011), and, much earlier, Mulligan et al. (1984). 2 An exception is Correia (2011). He explicitly works with a notion of ground-theoretic equivalence and implicit in his approach, I believe, is a notion of weak ground. He also provides a formal system and a semantics. c © Association for Symbolic Logic, 2011 1 doi:10.1017/S1755020311000086
منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملComputing Definite Logic Programs by Partial Instantiation
Kagan, V., A. Nerode and V.S. Subrahmanian, Computing definite logic programs by partial instantiation, Annals of Pure and Applied Logic 67 (1994) 161-182. Query processing in ground definite deductive databases is known to correspond precisely to a linear programming problem. However, the “groundedness” requirement is a huge drawback to using linear programming techniques for logic program com...
متن کاملA model of Cummings and Foreman revisited
This paper concerns the model of Cummings and Foreman where from ω supercompact cardinals they obtain the tree property at each אn for 2 ≤ n < ω. We prove some structural facts about this model. We show that the combinatorics at אω+1 in this model depend strongly on the properties of ω1 in the ground model. From different ground models for the CummingsForeman iteration we can obtain either אω+1...
متن کاملNumerical Analysis of the Primer Location Effect on Ground Vibration Caused by Blasting
Ground vibration is one of the undesirable results of blasting operations. Different methods have been proposed to predict and control ground vibration that is caused by blasting. These methods can be classified as laboratory studies, fieldwork and numerical modeling. Among these methods, numerical modeling is the one which saves time and cuts costs since it takes into account the basic princip...
متن کاملIS-MRAS With On-Line Adaptation Parameters Based on Type-2 Fuzzy LOGIC for Sensorless Control of IM
This paper suggests novel sensorless speed estimation for an induction motor (IM) based on a stator current model reference adaptive system (IS-MRAS) scheme. The IS-MRAS scheme uses the error between the reference and estimated stator current vectors and the rotor speed. Observing rotor flux and the speed estimating using the conventional MRAS technique is confronted with certain problems relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Rew. Symb. Logic
دوره 5 شماره
صفحات -
تاریخ انتشار 2012